Neighbourhood Gossiping in Hypercubes
نویسندگان
چکیده
In the neighbourhood gossiping problem, each node of a network starts with a unique message and must learn the messages of all of its neighbours. In this paper, we prove upper and lower bounds for neighbourhood gossiping in hypercubes under the single-port half-duplex and single-port full-duplex communication models.
منابع مشابه
Gossiping with Multiple Sends and Receives
We consider the problem of gossiping in several important networks in as few rounds as possible. During a single round, each processor may send an unlimited size message to k neighbors, or receive messages from k neighbors, but a processor cannot both send and receive during the same round. The network architectures we consider are trees, cycles, grids, hypercubes, and toroidal (or " wrap-aroun...
متن کاملFast gossiping with short unreliable messages
Each of n nodes of a communication network has a piece of information (gossip) which should be made known to all other nodes. Gossiping is done by sending letters. In a unit of time each node can either send one letter to a neighbor or receive one such letter, containing one gossip currently known to the sender. Letters reach their destinations with constant probability 0 < q < 1, independently...
متن کاملGossiping in Cayley Graphs by Packets
Gossiping (also called total exchange or all-to-all communication) is the process of information diiusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider here gossiping in the store-and-forward, full-duplex and-port (or shouting) model. In such a model, the protocol consists of a sequence of rounds and during each round, ea...
متن کاملNeighbourhood Broadcasting in Hypercubes
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbour at a time, broadcasting takes at least ⌈log2 N⌉ rounds in a network of N nodes. In the neighbourhood broadcasting problem, the node that is broadcasting only needs to inform its neighbours. In a binary hypercube with N nodes, each node has log2 N n...
متن کاملFast Gossiping by Short Messages
Gossiping is the process of information diiusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a xed number p of packets at each round. In the rst part of the paper we study the extremal case p = 1 and we e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 8 شماره
صفحات -
تاریخ انتشار 1998